Resolving Contested Elections: The Limited Power of Post-Vote Vote-Choice Data
نویسندگان
چکیده
منابع مشابه
Vote Buying I: General Elections
We examine the consequences of vote buying, assuming this practice were allowed and free of stigma. Two parties compete in a binary election and may purchase votes in a sequential bidding game via up-front binding payments and/or campaign promises (platforms) that are contingent upon the outcome of the election. We analyze the role of the partiesand voterspreferences in determining the winner...
متن کاملRecovering Vote Choice from Partial Incomplete Data
In voting rights cases, judges often infer unobservable individual vote choices from election data aggregated at the precinct level. That is, one must solve an ill-posed inverse problem to obtain the critical information used in these cases. The ill-posed nature of the problem means that traditional frequentist and Bayesian approaches cannot be employed without first imposing a range of assumpt...
متن کاملTiny Systematic Vote Manipulations Can Swing Elections
We examine the effects of a type of electoral fraud easily perpetrated by someone with access to the system software for a direct-recording electronic voting system. The hypothetical attacker modifies the software to arbitrarily change a small number of votes on each voting machine. We determine the effect of this manipulation on the electoral college results of the 2000 United States President...
متن کاملVote Trading in Public Elections (updated version)
During the 2000 U.S. Presidential race an apparently new idea, called vote trading, was introduced to help one of the two major-party candidates (Gore) win. The idea was, through an Internet mechanism, to induce voters who supported a minorparty candidate (Nader) to vote for Gore in states where this would help Gore and to induce an equal number of voters who supported Gore to vote for Nader in...
متن کاملResolving multi-proxy transitive vote delegation
Solving a delegation graph for transitive votes is already a non-trivial task for many programmers. When extending the current main paradigm, where each voter can only appoint a single transitive delegation, to a system where each vote can be separated over multiple delegations, solving the delegation graph becomes even harder. This article presents a solution of an example graph, and a non-for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2010
ISSN: 0162-1459,1537-274X
DOI: 10.1198/jasa.2009.ap08640